The Shortest Follies Are the Best

نویسنده

  • Polyxeni Potter
چکیده

Emerging Infectious Diseases • www.cdc.gov/eid • Vol. 18, No. 3, March 2012 541 “T is a kind of commerce betwixt beasts and us, a certain relation and mutual obligation, whereof there is no other reason, but that they belong to one and the same master, and are of the same family that we are,” wrote French philosopher and theologian Pierre Charron. Not a new idea, this partnership between humans and animals dates back 9,000 years to the domestication of animals in the Stone Age. And as far back as the Paleolithic Age, art on cave walls suggested a close, if perilous, human association with wild and dangerous beasts—a short folly, not common today, except among hunters and adventurers. Animals feature prominently in art of all ages, and in the 17th century, no longer as part of human scenes but as the primary subject matter. This shift signaled a change in the balance of power between owner and subservient beast, between humans and work animals. Dutch painter Paulus Potter understood this and expressed it by moving away from the human fi gure, traditionally the artist’s “noblest calling.” Some of his paintings contained no humans at all, bringing instead to center stage the horse or milk cow, the donkey or the mule, which until the advent of machines, were primary providers of agricultural, industrial, and other services. Potter received early instruction from his father, a noteworthy landscape and fi gure painter, and from Nicolaes Moeyaert and others, who painted biblical and mythologic scenes. But soon he took off in his own direction, precocious, prolifi c, and popular, learning from nature and painting furiously, as if anticipating his demise before the age of 30 from tuberculosis. He joined the guild of St. Luke in Delft, married well, and was soon noticed by Dutch surgeon and mayor of Amsterdam Nicolaes Tulp, who had also earlier commissioned young Rembrandt van Rijn to paint the famed Anatomy Lesson of Dr. Nicolaes Tulp. At the mayor’s invitation, Potter moved to Amsterdam, where, like Rembrandt before him, he became Tulp’s protégé. The portrait of Tulp’s equestrian son Dirk was Potter’s last work. His painting The Young Bull (1649) was to become as famous as Rembrandt’s Night Watch. During his brief artistic career, Potter became the most famous animalier of his day and a pioneer in featuring farm beasts outside the biblical or mythologic context. His approach infl uenced the presence and appearance of animals in European art. He painted them with sensitivity Paulus Potter (c. 1625–1654) God Appearing to Abraham at Sichem (1642) (detail) Oil on canvas (100.4 cm × 130.8 cm) From the collection of Dr. Gordon Gilbert, St. Petersburg, Florida, USA. Photo by Ray Bassett

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets

A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...

متن کامل

SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS

Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...

متن کامل

The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint

In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...

متن کامل

Finding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms

  The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...

متن کامل

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

Two optimal algorithms for finding bi-directional shortest path design problem in a block layout

In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2012